Algorithmic aspects of branched coverings II. Sphere bisets and their decompositions

نویسندگان

  • Laurent Bartholdi
  • Dzmitry Dudko
چکیده

We consider the action of mapping class groups, by preand postcomposition, on branched coverings, and encode them algebraically as mapping class bisets. We show how the mapping class biset of maps preserving a multicurve decomposes into mapping class bisets of smaller complexity, called small mapping class bisets. We phrase the decision problem of Thurston equivalence between branched self-coverings of the sphere in terms of the conjugacy and centralizer problems in a mapping class biset, and use our decomposition results on mapping class bisets to reduce these decision problems to small mapping class bisets. This is the main step in our proof of decidability of Thurston equivalence, as outlined in the first article of the series, since decidability of conjugacy and centralizer problems in the small mapping class bisets are well understood in terms of linear algebra, group theory and complex analysis. Branched coverings themselves are also encoded into bisets, with actions of the fundamental groups. We characterize those bisets that arise from branched coverings between topological spheres, and extend this correspondence to maps between spheres with multicurves, whose algebraic counterparts are sphere

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic aspects of branched coverings

This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of decompositions of bisets. We introduce a canonical “Levy” decomposition of an arbitrary Thurston map into homeomorphisms, metrically-expanding maps and maps dou...

متن کامل

STRONGLY-CYCLIC BRANCHED COVERINGS OF KNOTS VIA (g, 1)-DECOMPOSITIONS

Strongly-cyclic branched coverings of knots are studied by using their (g, 1)-decompositions. Necessary and sufficient conditions for the existence and uniqueness of such coverings are obtained. It is also shown that their fundamental groups admit geometric g-words cyclic presentations.

متن کامل

Uniform random sampling of simple branched coverings of the sphere by itself

We present the first polynomial uniform random sampling algorithm for simple branched coverings of the sphere by itself of degree n. More precisely, our algorithm generates in linear time increasing quadrangulations, which are equivalent combinatorial structures. Our result is based on the identification of some canonical labelled spanning trees, and yields a constructive proof of a celebrated ...

متن کامل

On realizability of branched coverings of the sphere

We introduce a simple geometric method of determining which abstract branch data can be realizable by branched coverings of the two-dimensional sphere S 2 (the Hurwitz problem). Using this method we the realizability of some classes of data.

متن کامل

The Thurston Type Theorem for Branched Coverings of Two-Sphere

I give a survey about a program which intends to find topological characterizations of a rational map and then use them to study the rigidity problem for rational maps. Thurston started this program by considering critically finite branched coverings and gave a necessary and sufficient combinatorial condition for a critically finite rational maps among all critically finite branched coverings. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1603.04059  شماره 

صفحات  -

تاریخ انتشار 2016